Implementation of an Event Driven Scheme for Visualizing Parallel Execution of Logic Programs
نویسندگان
چکیده
This article presents in an informal way some early results on the design of a series of paradigms for visualization of the parallel execution of logic programs. The results presented here refer to the visualization of or-parallelism, as in MUSE and Aurora, deterministic dependent and-parallelism, as in Andorra-I, and independent and-parallelism as in &-Prolog. A tool has been implemented for this purpose and has been interfaced with these systems. Results are presented showing the visualization of executions from these systems and the usefulness of the resulting tool is briefly discussed.
منابع مشابه
Some Paradigms for Visualizing Parallel Execution of Logic Programs
This paper addresses the design of visual paradigms for observing the parallel execution of logic programs. First, an intuitive method is proposed for arriving at the design of a paradigm and its implementation as a tool for a given model of parallelism. This method is based on stepwise reñnement starting from the deñnition of basic notions such as events and observables and some precedence rel...
متن کاملB-Log: A Branch and Bound Methodology for the Parallel Execution of Logic Programs
We propose a computational methodology -"B-LOG"-, which offers the potential for an effective implementation of Logic Programming in a parallel computer. We also propose a weighting scheme to guide the search process through the graph and we apply the concepts of parallel "branch and bound" algorithms in order to perform a "best-first" search using an information theoretic bound. The concept of...
متن کاملParallel Execution of Temporal Logic Programs Using Dataflow Computation
[ABSTRACT] The paper presents a data–driven execution model, CHEM, for a temporal logic programing language, Chronolog. An intermediate virtual machine is proposed, which is granulated at clause argument level to exploit argument parallelism through unification. Context–parallelism, inherent in temporal logic programs, is exploited through dynamic tagging approach typically used in dataflow com...
متن کاملParallel Execution of Temporal Logic
] The paper presents a data-driven execution model, CHEM, for a temporal logic programming language, Chronolog. An intermediate virtual machine is proposed, which is granulated at clause argument level to exploit argument paral-lelism through uniication. Context-parallelism, inherent in temporal logic programs, is exploited through dynamic tagging approach typically used in dataaow computers. T...
متن کاملGRAPH: A Tool for Visualizing Communication and Optimizing Layout in Data-Parallel Programs
*GRAPH is an event-driven visualization and optimization tool for data-parallel communication, currently implemented for the C* language on the CM-5. Its goal is to help data-parallel programmers reduce their communication costs by providing information about communication bottlenecks and suggesting system directives for an optimized data layout. To accomplish this, *GRAPH provides facilities f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992